- mod 2 polynomial
- полином (с коэффициентами) по модулю 2
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
mod 2 polynomial
Смотреть что такое "mod 2 polynomial" в других словарях:
Polynomial basis — In mathematics, the polynomial basis is a basis for finite extensions of finite fields.Let α ∈ GF( p m ) be the root of a primitive polynomial of degree m over GF( p ). The polynomial basis of GF( p m ) is then:{ 0, 1, alpha, ldots, alpha^{m… … Wikipedia
Schwartz-Zippel lemma and testing polynomial identities — Polynomial identity testing is the problem of determining whether a given multivariate polynomial is the0 polynomial or identically equal to 0. The input to the problem is an n variable polynomial over a fieldF. It can occur in the following… … Wikipedia
Zhegalkin polynomial — Zhegalkin (also Zegalkin or Gegalkine) polynomials form one of many possible representations of the operations of Boolean algebra. Introduced by the Russian mathematician I.I. Zhegalkin in 1927, they are the polynomials of ordinary high school… … Wikipedia
Degree of a polynomial — The degree of a polynomial represents the highest degree of a polynominal s terms (with non zero coefficient), should the polynomial be expressed in canonical form (i.e. as a sum or difference of terms). The degree of an individual term is the… … Wikipedia
Irreducible polynomial — In mathematics, the adjective irreducible means that an object cannot be expressed as a product of at least two non trivial factors in a given set. See also factorization. For any field F , the ring of polynomials with coefficients in F is… … Wikipedia
Quasi-polynomial — In mathematics, a quasi polynomial (pseudo polynomial) is a generalization of polynomials. While the coefficients of a polynomial come from a ring, the coefficients of quasi polynomials are instead periodic functions with integral period. Quasi… … Wikipedia
Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples … Wikipedia
Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… … Wikipedia
Eisenstein's criterion — In mathematics, Eisenstein s criterion gives sufficient conditions for a polynomial to be irreducible over the rational numbers (or equivalently, over the integers; see Gauss s lemma). Suppose we have the following polynomial with integer… … Wikipedia
Splitting of prime ideals in Galois extensions — In mathematics, the interplay between the Galois group G of a Galois extension L of a number field K, and the way the prime ideals P of the ring of integers OK factorise as products of prime ideals of OL, provides one of the richest parts of… … Wikipedia
General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of … Wikipedia
